P3T+: A performance estimator for distributed and parallel programs

نویسندگان

  • Thomas Fahringer
  • A. Pozgaj
چکیده

Developing distributed and parallel programs on today’s multiprocessor architectures is still a challenging task. Particular distressing is the lack of effective performance tools that support the programmer in evaluating changes in code, problem and machine sizes, and target architectures. In this paper we introduce P 3T+ which is a performance estimator for distributed and parallel programs. P 3T+ is unique by modeling programs, compiler code transformations, and parallel and distributed architectures. It computes at compile-time a variety of performance parameters including work distribution, number of transfers, amount of data transferred, transfer times, computation times, and number of cache misses. Several novel technologies are employed to compute these parameters: loop iteration spaces, array access patterns, and data distributions are modeled by employing highly effective symbolic analysis. Communication is estimated by simulating the behavior of a communication library used by the underlying compiler. Computation times are predicted through pre-measured kernels on every target architecture of interest. We carefully model most critical architecture specific factors such as cache lines sizes, number of cache lines available, startup times, message transfer time per byte, etc. P 3T+ has been implemented and is currently evaluated by several application developers. Experimental results for realistic kernel codes taken from real-world applications are presented to demonstrate both accuracy and usefulness of P 3T+.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of P3T+: A Performance Estimator for Distributed and Parallel Applications

Applications T. Fahringery A. Požgajy J. Luitz H. Moritschz yInstitute for Software Technology and Parallel Systems, University of Vienna Liechtensteinstrasse 22, A-1092, Vienna, Austria [tf,alex]@par.univie.ac.at zDepartment of Business, University of Vienna Brünner Strasse 72, A-1210 Vienna, Austria [email protected] Institute of Physical and Theoretical Chemistry, Vienna Uni...

متن کامل

P3T: An Automatic Performance Estimator for Parallel Programs

The area of parallelizing compilers for distributed memory multicomputers has seen considerable research activity during the last few years. Most of the current compilers do not provide any support for estimating performance impacts of code changes that they apply. In this paper, we present P 3 T, which is a static and automatic performance estimator for data parallel programs. It computes at c...

متن کامل

On estimating the useful work distribution of parallel programs under P3T: a static performance estimator

In order to improve a parallel program's performance it is critical to evaluate how even the work contained in a program is distributed over all processors dedicated to the computation. Traditional work distribution analysis is commonly performed at the machine level. The disadvantage of this method is that it cannot identify whether the processors are performing useful or redundant (replicated...

متن کامل

Static Task Allocation in Distributed Systems Using Parallel Genetic Algorithm

Over the past two decades, PC speeds have increased from a few instructions per second to several million instructions per second. The tremendous speed of today's networks as well as the increasing need for high-performance systems has made researchers interested in parallel and distributed computing. The rapid growth of distributed systems has led to a variety of problems. Task allocation is a...

متن کامل

A High Performance Parallel IP Lookup Technique Using Distributed Memory Organization and ISCB-Tree Data Structure

The IP Lookup Process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to IPv6 addresses. The IP address lookup involves computation of the Longest Prefix Matching (LPM), which existing solutions such as BSD Radix Tries, scale poorly when traıc in the router increases or when employed for IPv6 address lookups. In this paper, we describe a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Scientific Programming

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2000